EXPONENTIAL GROWTH RATE FOR DERIVATIVES OF STOCHASTIC FLOWS
نویسندگان
چکیده
منابع مشابه
Derivatives of the stochastic growth rate.
We consider stochastic matrix models for population driven by random environments which form a Markov chain. The top Lyapunov exponent a, which describes the long-term growth rate, depends smoothly on the demographic parameters (represented as matrix entries) and on the parameters that define the stochastic matrix of the driving Markov chain. The derivatives of a-the "stochastic elasticities"-w...
متن کاملPhenomenology of stochastic exponential growth.
Stochastic exponential growth is observed in a variety of contexts, including molecular autocatalysis, nuclear fission, population growth, inflation of the universe, viral social media posts, and financial markets. Yet literature on modeling the phenomenology of these stochastic dynamics has predominantly focused on one model, geometric Brownian motion (GBM), which can be described as the solut...
متن کاملUniversality in stochastic exponential growth.
Recent imaging data for single bacterial cells reveal that their mean sizes grow exponentially in time and that their size distributions collapse to a single curve when rescaled by their means. An analogous result holds for the division-time distributions. A model is needed to delineate the minimal requirements for these scaling behaviors. We formulate a microscopic theory of stochastic exponen...
متن کاملCalibration of stochastic models for interest rate derivatives
For the pricing of interest rate derivatives, various stochastic interest rate models are used. The shape of such a model can take very different forms, such as direct modeling of the probability distribution (e.g. a generalized beta function of second kind), a short rate model (e.g. a Hull-White model), or a forward rate model (e.g. a LIBOR market model). This paper describes the general struc...
متن کاملA Stochastic PCA Algorithm with an Exponential Convergence Rate
We describe and analyze a simple algorithm for principal component analysis, SVR-PCA, which uses computationally cheap stochastic iterations, yet converges exponentially fast to the optimal solution. In contrast, existing algorithms suffer either from slow convergence, or computationally intensive iterations whose runtime scales with the data size. The algorithm builds on a recent variance-redu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastics and Dynamics
سال: 2011
ISSN: 0219-4937,1793-6799
DOI: 10.1142/s0219493711003322